Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
نویسندگان
چکیده
منابع مشابه
Loopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
Abstract—For the minimum cardinality vertex cover and maximum cardinality matching problems, the max-product form of belief propagation (BP) is known to perform poorly on general graphs. In this paper, we present an iterative annealing BP algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover problem on general graphs. As a consequence, our anneali...
متن کاملLP Relaxation for Elastic Matching
According to [2], in this paper we discuss a new method to match two 3D shapes in a geometrically consistent way. We understand a matching as a diffemorphism and want to find the matching that minimizes the physical energy that is necessary to deform one shape into the other. Because of the fact that diffeomorphisms can be completely characterized by their graph, we propose an equivalent formul...
متن کاملLinear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investigate the use of the max-product form of belief propagation for weighted matching problems on general graphs. We show that max-product converges to the correct answer if the linear programming (LP) relaxation of the weigh...
متن کاملParallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − times the maximum for any given constant > 0. The second one is an NC approximation a...
متن کاملParalle Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The rst is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 times the maximum for any given constant > 0. The second one is an NC approximation algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2110170